On the Beck‐Fiala conjecture for random set systems
نویسندگان
چکیده
منابع مشابه
On the Beck-Fiala Conjecture for Random Set Systems
Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,Σ), where each element x ∈ X lies in t randomly selected sets of Σ, where t is an integer parameter. We provide new bounds in two regimes of parameters. We show that when |Σ| ≥ |X| the hereditary discrepancy of (X,Σ) is with high probability O( √ t log t); and ...
متن کاملQuasi-random Set Systems
There are many properties of mathematical objects that satisfy what is sometimes called a 0-1 law, in the following sense. Under some natural probability measure on the set of objects, the measure of the subset of objects having the given property is either 0 or 1. In the latter case we can say that almost all the objects have the property. Familiar examples of this phenomenon are the following...
متن کاملOn Falconer’s Distance Set Conjecture
In this paper, using a recent parabolic restriction estimate of Tao, we obtain improved partial results in the direction of Falconer’s distance set conjecture in dimensions d ≥ 3.
متن کاملOn Pósa's Conjecture for Random Graphs
The famous Pósa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Komlós, Sarközy and Szemerédi. Here we prove that if p ≥ n−1/2+ε, then asymptotically almost surely, the binomial random graph Gn,p contains the square of a Hamilton cycle. This provides an ‘approximate threshold’ for the property in the...
متن کاملOn Set Expansion Problems and the Small Set Expansion Conjecture
We study two problems related to the Small Set Expansion Conjecture [14]: the Maximum weight m′-edge cover (MWEC ) problem and the Fixed cost minimum edge cover (FCEC ) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2018
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20810